Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
751	Chapter 8 Advertising on the Web One of the big surprises of the 21st century has been the ability of all sorts of interesting Web applications to support themselves through advertising, rather than subscription. While Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2014-04-06 12:34:36 Combinatorial optimization NP-complete problems Graph coloring Matching Greedy algorithm Online algorithm Algorithm Greedy coloring Edge coloring Mathematics Graph theory Theoretical computer science
752	Chapter 8 Advertising on the Web One of the big surprises of the 21st century has been the ability of all sorts of interesting Web applications to support themselves through advertising, rather than subscription. While Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2012-07-04 16:03:39 Combinatorial optimization NP-complete problems Graph coloring Matching Greedy algorithm Online algorithm Algorithm Greedy coloring Edge coloring Mathematics Graph theory Theoretical computer science
753	1 Excercise[removed]Consider the complete graph K4 with four vertices; all vertices are connected by an edge to all other vertices. Suppose now we flip an unbiased coin for each Add to Reading List Source URL: www.trancethrust.nl Language: English - Date: 2012-05-06 05:29:24 Matroid theory Graph operations Graph Planar graphs Connectivity Edge coloring Pseudoforest Graph theory Mathematics Graph coloring
754	Manifold Spanning Graphs CJ Carey and Sridhar Mahadevan School of Computer Science University of Massachusetts, Amherst Amherst, Massachusetts, 01003 {ccarey,mahadeva}@cs.umass.edu Add to Reading List Source URL: nemo.cs.umass.edu Language: English - Date: 2014-06-25 13:10:11 Spanning tree Minimum spanning tree Nonlinear dimensionality reduction Depth-first search Matching Graph Manifold Edge coloring Pseudoforest Graph theory Mathematics Theoretical computer science
755	3-Steiner Simplicial Elimination Orderings Iain Crump∗and Ortrud R. Oellermann† University of Winnipeg, 515 Portage Avenue Winnipeg, MB R3B 2E9, Canada e-mail: [removed] Add to Reading List Source URL: ion.uwinnipeg.ca Language: English - Date: 2010-09-24 15:00:12 Graph Greedy coloring Tree Neighbourhood Lexicographic breadth-first search End Induced path Cograph Hypergraph Graph theory Graph operations Chordal graph
756	Combinatorial Optimization: Packing and Covering G´erard Cornu´ejols Carnegie Mellon University July 2000 Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2005-08-27 11:07:38 Graph coloring Planar graphs Edge coloring Sperner family Matroid Bipartite graph Petersen graph Cubic graph Minor Graph theory Mathematics Matroid theory
757	Hyperplane Annealing and Activator-Inhibitor-Systems Add to Reading List Source URL: tlausser.com Language: English - Date: 2001-11-28 19:57:18 NP-complete problems Operations research Mathematical optimization Simulated annealing Relaxation Combinatorial optimization Travelling salesman problem Graph coloring Annealing Theoretical computer science Mathematics Applied mathematics
758	On an optimal randomized acceptor for graph nonisomorphism∗ Edward A. Hirsch†,‡ Dmitry Itsykson† November 9, 2011 Add to Reading List Source URL: logic.pdmi.ras.ru Language: English - Date: 2011-11-09 06:46:56 Analysis of algorithms Mathematical optimization Complexity classes Graph coloring NP-complete Randomized algorithm P versus NP problem NP Time complexity Theoretical computer science Computational complexity theory Applied mathematics
759	A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics ∗ Stanislav Busygin [removed] http://www.stasbusygin.org Add to Reading List Source URL: www.stasbusygin.org Language: English - Date: 2009-02-11 00:35:51 Graph operations Graph coloring Clique problem Clique Independent set Neighbourhood Degree Path decomposition Maximal independent set Graph theory Theoretical computer science NP-complete problems
760	A Least Squares Framework for the Maximum Weight Clique Problem ∗ Stanislav Busygin [removed] http://www.stasbusygin.org October 14, 2007, updated: May 29, 2010 Add to Reading List Source URL: www.stasbusygin.org Language: English - Date: 2010-05-30 08:45:57 NP-complete problems Graph operations Clique problem Clique Line graph Graph coloring Eigenvalues and eigenvectors Graph theory Mathematics Theoretical computer science

UPDATE